Modified Vogel’s approximation method for transportation problem under uncertain environment
نویسندگان
چکیده
منابع مشابه
An Approximation Method for Fuzzy Fixed-Charge Transportation Problem
In this paper, we develop the fuzzy fixed charge transportation problem when the costs are the fuzzy numbers. The first step it transform into the classical fuzzy transportation problem. The next, we obtain the best approximation fuzzy on the optimal value of the fuzzy fixed-charge transportation problem. This method obtains a lower and upper bounds both on the fuzzy optimal value of the fuzzy ...
متن کاملClassical Center Location Problem Under Uncertain Environment
This paper investigates the $p$-center location problem on a network in which vertex weights and distances between vertices are uncertain. The concepts of the $alpha$-$p$-center and the expected $p$-center are introduced. It is shown that the $alpha$-$p$-center and the expected $p$-center models can be transformed into corresponding deterministic models. Finally, linear time algorithms for find...
متن کاملSingle-period inventory problem under uncertain environment
This paper investigates the single period inventory Newsboy problem in a general uncertain environment. Here it is assumed that the uncertainty appears in the market demand of the product. Uncertain demand is used to describe a subjective estimate (not estimated by random/fuzzy demand), linguistically expressed by ‘‘demand is about n’’. Using identification functions of the uncertain variable w...
متن کاملModified Vogel’s Approximation Method for Fuzzy Transportation Problems
New algorithm named, Modified Vogel’s Approximation Method (MVAM) is proposed for solving fuzzy transportation problem. This algorithm is more efficient than other existing algorithms. The procedure for the solution is illustrated with a numerical example. Further, comparative study among the new algorithm and the other existing algorithms is established by means of sample problem.
متن کاملFuzzy Dijkstra algorithm for shortest path problem under uncertain environment
A common algorithm to solve the shortest path problem (SPP) is the Dijkstra algorithm. In this paper, a generalized Dijkstra algorithm is proposed to handle SPP in an uncertain environment. Two key issues need to be addressed in SPP with fuzzy parameters. One is how to determine the addition of two edges. The other is how to compare the distance between two different paths with vailable online ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Complex & Intelligent Systems
سال: 2020
ISSN: 2199-4536,2198-6053
DOI: 10.1007/s40747-020-00153-4